#include "BTree.cpp"		//包含二叉链的基本运算函数
int main() {
    char str[] = "A(B(D,E(G,H)),C(,F(I)))"; //括号表示法
    char *pstr = str;
    BTNode *bt = CreateBTree(pstr); //创建二叉树bt
    printf("二叉树bt:");
    DispBTree(bt);
    printf("\n");
    printf("bt的高度:%d\n", BTHeight(bt));
    printf("bt的结点数:%d\n", NodeCount(bt));
    printf("bt的叶子结点数:%d\n", LeafCount(bt));

    printf("绘制树:\n");
    DrawTree(bt);	//层次遍历输出bt
    printf("\n");
}

